A Probabilistic Estimator for the Vertex Deletion Problem
نویسندگان
چکیده
Vertex deletion is a well known NP-complete problem. An empirical method for estimating the number of vertices that need to be deleted to make a graph bipartite is presented. The estimator has been developed by modelling the problem using random graphs where an edge is present with a xed probability p. The method works in O(n 2) time, where n is the number of vertices in the graph. The estimator has been experimented on several randomly generated graphs. The results indicate that the estimator gives accurate results for graphs of various sizes.
منابع مشابه
The robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملA Facility Location Problem with Tchebychev Distance in the Presence of a Probabilistic Line Barrier
This paper considers the Tchebychev distance for a facility location problem with a probabilistic line barrier in the plane. In particular, we develop a mixed-integer nonlinear programming (MINLP) model for this problem that minimizes the total Tchebychev distance between a new facility and the existing facilities. A numerical example is solved to show the validity of the developed model. Becau...
متن کاملLiu Estimates and Influence Analysis in Regression Models with Stochastic Linear Restrictions and AR (1) Errors
In the linear regression models with AR (1) error structure when collinearity exists, stochastic linear restrictions or modifications of biased estimators (including Liu estimators) can be used to reduce the estimated variance of the regression coefficients estimates. In this paper, the combination of the biased Liu estimator and stochastic linear restrictions estimator is considered to overcom...
متن کاملParameterized complexity of fair deletion problems II
Vertex deletion problems are those where given a graph G and a graph property π, the goal is to find a subset of vertices W such that G \W satisfies property π. Typically, we want to minimize size of the deletion set W . Unlike this, in fair vertex deletion problems we change the objective: we minimize the maximum number of vertices deleted in neighborhood of any vertex. When the property π is ...
متن کاملProbabilistic Multi Objective Optimal Reactive Power Dispatch Considering Load Uncertainties Using Monte Carlo Simulations
Optimal Reactive Power Dispatch (ORPD) is a multi-variable problem with nonlinear constraints and continuous/discrete decision variables. Due to the stochastic behavior of loads, the ORPD requires a probabilistic mathematical model. In this paper, Monte Carlo Simulation (MCS) is used for modeling of load uncertainties in the ORPD problem. The problem is formulated as a nonlinear constrained mul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007